package main.java.indi.zyj.coderecord;

public class Rob2 {

    public int rob(int[] nums) {

        int len = nums.length;

        if (nums == null || len == 0) return 0;
        if (len == 1) return nums[0];
        if (len == 2) return Math.max(nums[0], nums[1]);


        return Math.max(rob(nums, 0, len - 1), rob(nums, 1, len));

    }

    public int rob (int[] nums, int start, int rear) {
        int[] dp = new int[nums.length];
        dp[start] = nums[start];
        dp[start + 1] = Math.max(nums[start], nums[start + 1]);

        // dp[i] = Math.max(dp[i - 2] + nums[i], dp[i - 1]);
        for (int i = start + 2; i < rear; i++) {
            dp[i] = Math.max(dp[i - 2] + nums[i], dp[i - 1]);
        }
        return dp[rear - 1];
    }

}
